ELEMENTARY

In computational complexity theory, the complexity class ELEMENTARY of elementary recursive functions is the union of the classes in the exponential hierarchy.

\begin{matrix} \mathrm{ELEMENTARY} & = & \mathrm{EXP}\cup\mathrm{2EXP}\cup\mathrm{3EXP}\cup\cdots \\ & = & \mathrm{DTIME}(2^{n})\cup\mathrm{DTIME}(2^{2^{n}})\cup \mathrm{DTIME}(2^{2^{2^{n}}})\cup\cdots \end{matrix}

The name was coined by László Kalmár, in the context of recursive functions and undecidability; most problems in it are far from elementary. Some natural recursive problems lie outside ELEMENTARY, and are thus NONELEMENTARY. Most notably, there are primitive recursive problems which are not in ELEMENTARY. We know

LOWER-ELEMENTARY \subsetneq EXPTIME \subsetneq ELEMENTARY \subsetneq PR

Whereas ELEMENTARY contains bounded applications of exponentiation (for example, O(2^{2^n})), PR allows more general hyper operators (for example, tetration) which are not contained in ELEMENTARY.

Contents

Definition

The definitions of elementary recursive functions are the same as for primitive recursive functions, except that primitive recursion is replaced by bounded summation and bounded product. All functions work over the natural numbers. The basic functions, all of them elementary recursive, are:

  1. Zero function. Returns zero: f(x) = 0.
  2. Successor function: f(x) = x + 1. Often this is denoted by S, as in S(x). Via repeated application of a successor function, one can achieve addition.
  3. Projection functions: these are used for ignoring arguments. For example, f(a, b) = a is a projection function.
  4. Subtraction function: f(x, y) = x - y if y < x, or 0 if y ≥ x. This function is used to define conditionals and iteration.

From these basic functions, we can build other elementary recursive functions.

  1. Composition: applying values from some elementary recursive function as an argument to another elementary recursive function. In f(x1, ..., xn) = h(g1(x1, ..., xn), ..., gm(x1, ..., xn)) is elementary recursive if h is elementary recursive and each gi is elementary recursive.
  2. Bounded summation: f(m, x_1, \ldots, x_n) = \sum\limits_{i=0}^mg(i, x_1, \ldots, x_n) is elementary recursive if g is elementary recursive.
  3. Bounded product: f(m, x_1, \ldots, x_n) = \prod\limits_{i=0}^mg(i, x_1, \ldots, x_n) is elementary recursive if g is elementary recursive.

Lower elementary recursive functions

Lower elementary recursive functions follow the definitions as above, except that bounded product is disallowed. That is, a lower elementary recursive function must be a zero, successor, or projection function, a composition of other lower elementary recursive functions, or the bounded sum of another lower elementary recursive function.

Whereas elementary recursive functions have potentially exponential growth, and comprise the exponential hierarchy, the lower elementary recursive functions have polynomial growth.

Basis for ELEMENTARY

The class of elementary functions coincides with the closure with respect to composition of the projections and one of the following function sets: \{ n%2B1, n \stackrel{.}{-} m, \lfloor n/m \rfloor, n^{m} \}, \{ n%2Bm, n \stackrel{.}{-} m, \lfloor n/m\rfloor, 2^{n} \}, \{ n%2Bm, n^{2}, n \bmod m, 2^{n} \}, where n \stackrel{.}{-} m = \max\{n-m, 0\} is the subtraction function defined above.[1]

Descriptive characterization

In descriptive complexity, ELEMENTARY is equal to the class of high order queries.[2] This means that every language in the ELEMENTARY complexity class can be written as a high order formula that is true only for the elements on the language. More precisely, \mathrm{NTIME}(2^{2^{\cdots{2^{O(n)}}}}) = \exists{}HO^i, where \cdots indicates a tower of i exponentiations and \exists{}HO^i is the class of queries that begin with existential quantifiers of ith order and then a formula of (i-1)th order.

See also

References

  1. ^ Mazzanti, S., "Plain Bases for Classes of Primitive Recursive Functions", Mathematical Logic Quarterly, 48 (2002) 93-104
  2. ^ Lauri Hella and José María Turull-Torres (2006), "Computing queries with higher-order logics", Theoretical Computer Science (Essex, UK: Elsevier Science Publishers Ltd.) 355 (2): 197–214, ISSN 0304-3975, http://portal.acm.org/citation.cfm?id=1142890.1142897 
Classes considered feasible
DLOGTIME • AC0 • ACC0 • TC0 • L • SL • RL • NL • NC • SC • P (P-complete) • ZPP • RP • BPP • BQP 
Classes suspected to be infeasible
UP • NP (NP-complete · NP-hard · co-NP · co-NP-complete) • AM • PH • PP • #P (#P-complete) • IP • PSPACE (PSPACE-complete)
Classes considered infeasible
EXPTIME • NEXPTIME • EXPSPACE • ELEMENTARY • PR • R • RE • ALL
Class hierarchies
Families of complexity classes